NP search problems in low fragments of bounded arithmetic
نویسندگان
چکیده
منابع مشابه
NP search problems in low fragments of bounded arithmetic
We give combinatorial and computational characterizations of the NP search problems definable in the bounded arithmetic theories T 2 2 and T 3 2 . By a search problem in full generality we mean simply a binary relation R(x, y) such that ∀x∃yR(x, y) holds. The search task is: given an instance x find a solution y such that R(x, y) holds. The most important class of search problems are NP search ...
متن کاملThe provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the ∀Σb1 consequences of V 1 2 and that natural restrictions of it characterize the ∀Σb1 consequences of U 1 2 and of the bounded arithmetic hierarchy. We also show that over V 0 it characterizes the ∀ΣB0 consequences of V 1 a...
متن کاملA Characterisation of Definable NP Search Problems in Peano Arithmetic
The complexity class of ≺-bounded local search problems with goals is introduced for well-orderings ≺, and is used to give a characterisation of definable NP search problems in Peano Arithmetic.
متن کاملCharacterising Definable Search Problems in Bounded Arithmetic via Proof Notations
The complexity class of Πpk-Polynomial Local Search (PLS) problems with Πp` -goal is introduced, and is used to give new characterisations of definable search problems in fragments of Bounded Arithmetic. The characterisations are established via notations for propositional proofs obtained by translating Bounded Arithmetic proofs using the Paris-Wilkie-translation. For ` ≤ k, the Σ`+1-definable ...
متن کاملWitnessing Functions in Bounded Arithmetic and Search Problems
We investigate the possibility to characterize (multi)functions that are b i-deenable with small i (i = 1; 2; 3) in fragments of bounded arithmetic T2 in terms of natural search problems deened over polynomial-time structures. We obtain the following results: 1. A reformulation of known characterizations of (multi)functions that are b 1-and b 2-deenable in the theories S 1 2 and T 1 2. 2. New c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2007
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl/1185803628